Optimizing my Ford-Fulkerson implementation for sparse graphs.
[and.git] / 10181 - 15-Puzzle problem / p10181.cpp
blob0fc6ac798b0a2aa766b43b697ebe34f6636a4568
1 #include <iostream>
2 #include <map>
4 using namespace std;
6 typedef unsigned long long ull;
8 ull final = 0x123456789ABCDEF0LL;
10 int main(){
11 printf("%llX\n", final);
12 return 0;